Universal Guard Problems
نویسندگان
چکیده
We provide a spectrum of results for the Universal Guard Problem, in which one is to obtain a small set of points (“guards”) that are “universal” in their ability to guard any of a set of possible polygonal domains in the plane. We give upper and lower bounds on the number of universal guards that are always sufficient to guard all polygons having a given set of n vertices, or to guard all polygons in a given set of k polygons on an n-point vertex set. Our upper bound proofs include algorithms to construct universal guard sets of the respective cardinalities.
منابع مشابه
Universal Guard Problems ∗ Sándor
We provide a spectrum of results for the Universal Guard Problem, in which one is to obtain a small set of points (“guards”) that are “universal” in their ability to guard any of a set of possible polygonal domains in the plane. We give upper and lower bounds on the number of universal guards that are always sufficient to guard all polygons having a given set of n vertices, or to guard all poly...
متن کاملInapproximability Results for Guarding Polygons without Holes
The three art gallery problems Vertex Guard, Edge Guard and Point Guard are known to be NP -hard [8]. Approximation algorithms for Vertex Guard and Edge Guard with a logarithmic ratio were proposed in [7]. We prove that for each of these problems, there exists a constant > 0, such that no polynomial time algorithm can guarantee an approximation ratio of 1 + unless P = NP . We obtain our results...
متن کاملComplexity of minimum corridor guarding problems
In this paper, the complexity of minimum corridor guarding problems is discussed. These problem can be described as: given a connected orthogonal arrangement of vertical and horizontal line segments and a guard with unlimited visibility along a line segment, find a tree or a closed tour with minimum total length along edges of the arrangement, such that if the guard runs on the tree or on the c...
متن کاملTowards Proper Guard Zones for Link Signature.dvi
Motivated by information-theoretic security, link signature (LS) based security mechanisms exploit the ample channel characteristics between wireless devices for security establishment. Nevertheless, LS is originated from wireless environments and hence may exhibit potential vulnerabilities that can be exploited by adversary in the vicinity. As to this, it is widely believed in existing literat...
متن کاملInapproximability of some art gallery problems
We prove that the three art gallery problems Vertex Guard, Edge Guard and Point Guard for simple polygons with holes cannot be approximated by any polynomial time algorithm with a ratio of 1? 28 ln n, for any > 0, unless N P T IM E(n O(log log n)). We obtain our results by extending and modifying the concepts of a construction introduced in Eide98].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016